Optimization problem

Results: 1483



#Item
171Operations research / Discrete geometry / NP-complete problems / Conjectures / Circle packing / Sphere packing / Independent set / Kepler conjecture / Tammes problem / Mathematical optimization / Semidefinite programming / FranklRdl graph

Moment methods in energy minimization David de Laat CWI Amsterdam Andrejewski-Tage Moment problems in theoretical physics

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
172NP-complete problems / Trapezoid graph / Interval graph / Perfect graph / Indifference graph / Independent set / Permutation graph / Clique problem / Hamiltonian path problem / Longest path problem / Pathwidth / Intersection graph

Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-12-21 16:02:55
173Game theory / Nash equilibrium / Price of anarchy / Shortest path problem / Congestion game / Economic equilibrium / Mathematical optimization / Strategy / Stochastic game / Routing

Stochastic Selfish Routing E. Nikolova1 and N. E. Stier-Moses2 1 2

Add to Reading List

Source URL: faculty.cse.tamu.edu

Language: English - Date: 2011-07-24 10:48:15
174Operations research / Auction theory / Mechanism design / Game theory / VickreyClarkeGroves mechanism / Vickrey auction / Optimization problem / Mathematical optimization / Steiner tree problem / Shortest path problem / Microeconomics

Optimal Efficiency Guarantees for Network Design Mechanisms? Tim Roughgarden??1 and Mukund Sundararajan? ? ?1 Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, CA 94305.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2007-04-09 01:40:43
175Graph coloring / Computational problems / Combinatorial optimization / Matching / Graph minor / Gap reduction / Shortest path problem / Sharp-P-completeness of 01-permanent

The Complexity of Rationalizing Network Formation Shankar Kalyanaraman Computer Science Department California Institute of Technology Pasadena, CAEmail:

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2009-08-11 16:34:41
176Mathematical optimization / Operations research / Dynamic programming / Equations / Optimal control / Systems engineering / Algorithm / Problem solving / Shortest path problem / Greedy algorithm / Optimal substructure

. CS711008Z Algorithm Design and Analysis Lecture 7. Basic algorithm design technique: Greedy .

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-11-19 07:35:23
177Web analytics / Alphabet Inc. / StatCounter / Internet marketing / Google Search Console / Google Search / Search engine optimization / Google / Analytics

News Release Web analytics firm StatCounter adds new feature to help manage Google ‘not provided’ keyword problem - Integrated reporting designed to simplify keyword analysis for busy search professionals and website

Add to Reading List

Source URL: sr.statcounter.com

Language: English - Date: 2014-07-15 04:00:29
178Search engine optimization / Link analysis / World Wide Web / Markov models / PageRank / Reputation management / Game theory / Graph theory / Webgraph / Backlink

Related Work Description of the Problem Our Work Game-theoretic aspects of link placement in the WorldWide Web

Add to Reading List

Source URL: pages.cs.aueb.gr

Language: English - Date: 2013-09-14 08:14:25
179Dynamic programming / Equations / Mathematical optimization / Operations research / Optimal control / Systems engineering / Tree / HopcroftKarp algorithm / Vertex cover

Preventing Unraveling in Social Networks: The Anchored k-Core Problem Kshipra Bhawalkar1 , Jon Kleinberg2 , Kevin Lewi1 , Tim Roughgarden1 , and Aneesh Sharma3 1 Stanford University, Stanford, CA, USA Cornell University,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2013-07-09 15:08:31
180Operations research / Linear programming / Mathematical optimization / Convex optimization / Algorithm / Candidate solution / Simplex algorithm / Linear programming relaxation

CS261: Problem Set #3 Due by 11:59 PM on Tuesday, February 23, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions: We are using Gr

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-24 10:23:04
UPDATE